Fault-tolerant path embedding in folded hypercubes with both node and edge faults

Edge-fault-tolerant properties of hypercubes and folded hypercubes

1-vertex-fault-tolerant Cycles Embedding on Folded Hypercubes

In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f be a faulty vertex in an n-dimensional folded hypercube FQn. We show that FQn−{f } contains a faultfree cycle of every even length from 4 to 2n−2 if n ≥ 3 and, furthermore, every odd length from n+ 1 to 2n − 1 if n ≥ 2 and n is even....

Fault-tolerant cycle embedding in dual-cube with node faults

A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m + 1 links per node, where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2 clusters and hence the total number of nodes in a DC(m) is 2 + . In this paper, by using Gray code, we show that there exists a fault-free cycle containi...

On conditional edge-fault-tolerant cycles embedding of hypercubes

The hypercube has been one of the most popular interconnection networks for parallel computer/communication system. In this papers, we assume that each node is incident with at least two fault-free links. Under this assumption, we show that every fault-free edge lies on a fault-free cycle of every even length from 6 to 2 inclusive even if it has up to 2n − 5 link faults. The result is optimal w...

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes

Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...